منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولHyperoctahedral Eulerian Idempotents, Hodge Decompositions, and Signed Graph Coloring Complexes
Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperoctahedral Eulerian idempotents.
متن کاملColoring Signed Graphs
This survey paper provides an introduction to signed graphs, focusing on coloring. We shall introduce the concept of signed graphs, a proper coloring, and basic properties, such as a balanced graph and switchings. We will examine the chromatic number for six special signed graphs, upper bound the chromatic number, and discuss practical applications of signed graphs.
متن کاملColoring signed graphs using DFS
We show that depth first search can be used to give a proper coloring of connected signed graphs G using at most ∆(G) colors, provided G is different from a balanced complete graph, a balanced cycle of odd length, and an unbalanced cycle of even length, thus giving a new, short proof to the generalization of Brooks’ theorem to signed graphs, first proved by Máčajová, Raspaud, and Škoviera.
متن کاملAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1982
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90144-3